package com.person.leetcode.editor.cn;

/**
  * 357.统计各位数字都不同的数字个数
  * 2022-04-11 16:49:42
**/
public class Sequence_0357_CountNumbersWithUniqueDigits {
    public static void main(String[] args) {
        Solution solution = new Sequence_0357_CountNumbersWithUniqueDigits().new Solution();
    }
    //leetcode submit region begin(Prohibit modification and deletion)
class Solution {
    public int countNumbersWithUniqueDigits(int n) {
        //排列组合
        //0 0 A(1,1) 1              1
        //1 9 A(10,1) 9             10
        //2 99 A(10,2) 90           91
        //2 999 A(10,3) 720  9+10   739
        //3 A(10,4)
        return 0;
    }
}
//leetcode submit region end(Prohibit modification and deletion)

}
